automaton theory造句
例句與造句
- Abstract automata theory
抽象自動機理論 - Automata theory allows practice with formal definitions of computation as it introduces concepts relevant to other nontheoretical areas of computer science
自動控制理論允許執(zhí)行正式的計算定義，因為它引用了相關的計算機科學的其他非理論方面的概念。 - Existing complexity proofs on the circularity problem of ags are based on automata theory , such as writing pushdown acceptor and alternating turing machines
目前對屬性文法循環(huán)性問題復雜度的證明，多基于自動機理論，如寫入推出接受器、交替涂林機等。 - This paper presents some cellular automata models for traffic flow simulation . firstly , the celluar automata theory was introduced , cellular autoata models quantize complex behavior into simple individual components
本文首先介紹了元胞自動機理論的理論，元胞自動機模型把復雜系統(tǒng)量化為簡單的個體。 - Security analyses of a variant of a new block cipher system ( called cac ) based on cellular automata theory are given using two cryptanalytic approaches . the results show that this variant of cac is very insecure under chosen - plaintext attacks
利用兩種方法對一個基于細胞自動機的分組密碼系統(tǒng)cac的變形進行了分析，結果表明： cac的這種變形在選擇明文攻擊下是極不安全的。 - It's difficult to find automaton theory in a sentence. 用automaton theory造句挺難的
- The paper formally defines the concept of electronic contract and their goals , obligations , bindings and non - repudiatable proofs by the formal language and automata theory . by making the obligations and proofs work together , the partners are enforced to achieve the business goals
本文用形式語言與自動機理論對電子合同及其目標、責任、約束以及不可抵賴性證據(jù)進行形式化定義，使責任和證據(jù)相互配合，迫使達到商業(yè)目標。 - Automata theory is an important branch of computer science theory . it is widely applied in many fields , such as communication , detection , biology , neurology , psychology , intelligence , economy , and sociology . the research on it is closely related to the development of computer software and hardware
自動機理論是計算機科學中的一個重要組成部分，在通訊、檢測、生物、神經(jīng)、心理、智能、經(jīng)濟和社會等諸多領域都有著廣泛應用，其研究與計算機軟硬件發(fā)展密切相關。 - In multiple - valued logic theory , completeness theory of function sets is an important and fundamental problem , it is also the problem which must be solved in automata theory and multiple - valued logic network . the solution of this problem depends on determining all the precomplete classes in multiple - valued logic function sets
函數(shù)系的完備性判定問題是多值邏輯理論中基本而重要的問題，同時也是自動機理論，多值邏輯網(wǎng)絡中必須解決的問題，此問題的解決依賴于定出多值邏輯函數(shù)集中的所有極大封閉集(準完備集) 。